A Non–Convex Optimization Approach to Correlation Clustering
نویسندگان
چکیده
منابع مشابه
A New Approach to Nonconvex Optimization
In this paper we propose a new approach based on global optimality conditions for solving continuous nonconvex optimization problems. We present in detail a technique for nding a solution to the following three problems: the problem of polyhedral separability, the problem of solving a system of nonlinear equations, and the problem of nding the Nash equilibrium point in bimatrix games by means o...
متن کاملSpectral Approach to Duality in Nonconvex Global Optimization∗
A nonconvex problem of constrained optimization is analyzed in terms of its ordinary Lagrangian function. New sufficient conditions are obtained for the duality gap to vanish. Among them, the main condition is that the objective and constraint functions be the sums of convex functionals and nonconvex quadratic forms with certain specific spectral properties. The proofs are related to extensions...
متن کاملA Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm
Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...
متن کاملLarge Scale Correlation Clustering Optimization
Clustering is a fundamental task in unsupervised learning. The focus of this paper is the Correlation Clustering functional which combines positive and negative affinities between the data points. The contribution of this paper is two fold: (i) Provide a theoretic analysis of the functional. (ii) New optimization algorithms which can cope with large scale problems (> 100K variables) that are in...
متن کاملH ∞ Synthesis via a Nonsmooth, Nonconvex Optimization Approach
A numerical method for solving the H∞ synthesis problem is presented. The problem is posed as an unconstrained, nonsmooth, nonconvex minimization problem. The optimization variables consist solely of the entries of the output feedback matrix. No additional variables, such as Lyapunov variables, need to be introduced. The main part of the optimization procedure uses a line search mechanism where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33015159